Se p 20 09 Autocorrelation - Run Formula for Binary Sequences ∗

نویسنده

  • Kai Cai
چکیده

The autocorrelation function and the run structure are two basic notions for binary sequences, and they have been used as two independent criterions to characterize the randomness of binary sequences for more than 30 years. In this paper, we establish a run series expansion formula for autocorrelation function of the binary sequence and show that the autocorrelation function is in fact completely determined by the run structure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Autocorrelation-Run Formula for Binary Sequences

The autocorrelation function and the run structure are two basic notions for binary sequences, and have been used as two independent postulates to test randomness of binary sequences ever since Golomb 1955. In this paper, we prove for binary sequence that the autocorrelation function is in fact completely determined by its run structure.

متن کامل

nt - p h / 04 09 15 2 v 1 2 2 Se p 20 04 A product formula and combinatorial field theory

We treat the problem of normally ordering expressions involving the standard boson operators a, a where [a, a] = 1. We show that a simple product formula for formal power series — essentially an extension of the Taylor expansion — leads to a double exponential formula which enables a powerful graphical description of the generating functions of the combinatorial sequences associated with such f...

متن کامل

New Optimal Binary Sequences with Period $4p$ via Interleaving Ding-Helleseth-Lam Sequences

Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design. Ding-Helleseth-Lam sequences are such a class of binary sequences of period p, where p is an odd prime with p ≡ 1(mod 4). The objective of this letter is to present a con...

متن کامل

Exhaustive Search for Low Autocorrelation Binary Sequences

Binary sequences with low autocorrelations are important in communication engineering and in statistical mechanics as groundstates of the Bernasconimodel. Computer searches are the main tool to construct such sequences. Due to the exponential size O(2 ) of the configuration space, exhaustive searches are limited to short sequences. We discuss an exhaustive search algorithm with run time charact...

متن کامل

New Quaternary Sequences with Ideal Autocorrelation Constructed from Legendre Sequences

In this paper, for an odd prime p, new quaternary sequences of even period 2p with ideal autocorrelation property are constructed using the binary Legendre sequences of period p. For the new quaternary sequences, two properties which are considered as the major characteristics of pseudo-random sequences are derived. Firstly, the autocorrelation distribution of the proposed quaternary sequences ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009